Linearization of functions
نویسندگان
چکیده
منابع مشابه
Efficient Linearization of Tree Kernel Functions
The combination of Support Vector Machines with very high dimensional kernels, such as string or tree kernels, suffers from two major drawbacks: first, the implicit representation of feature spaces does not allow us to understand which features actually triggered the generalization; second, the resulting computational burden may in some cases render unfeasible to use large data sets for trainin...
متن کاملPiecewise Linearization of Real-valued Subanalytic Functions
We show that for a subanalytic function / on a locally compact subanalytic set X there exists a unique subanalytic triangulation (a simplicial complex K , a subanalytic homeomorphism n: \K\ —► X) such that f o n\a , a 6 K , are linear. Let X be a subanalytic set contained and closed in a Euclidean space. A subanalytic triangulation of X is a pair (K , n) where K isa simplicial complex and n is ...
متن کاملSatisfiability Modulo Transcendental Functions via Incremental Linearization
In this paper we present an abstraction-refinement approach to Satisfiability Modulo the theory of transcendental functions, such as exponentiation and trigonometric functions. The transcendental functions are represented as uninterpreted in the abstract space, which is described in terms of the combined theory of linear arithmetic on the rationals with uninterpreted functions, and are incremen...
متن کاملFitting Aggregation Functions to Data: Part I - Linearization and Regularization
The use of supervised learning techniques for fitting weights and/or generator functions of weighted quasi-arithmetic means – a special class of idempotent and nondecreasing aggregation functions – to empirical data has already been considered in a number of papers. Nevertheless, there are still some important issues that have not been discussed in the literature yet. In the first part of this ...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Annalen
سال: 2004
ISSN: 0025-5831,1432-1807
DOI: 10.1007/s00208-003-0502-1